Effects of multiple delays on dynamics of a five-neuron network model

A five-neuron network model with multiple delays is proposed. This paper presents the combined effect of different delays on the dynamics of the proposed network. Pitchfork bifurcation is discussed in detail with the variation of the value of coupled weight or attenuation rate of internal neurons. By analyzing the corresponding characteristic equation, some stable criteria on delay-dependence and delay-independence are derived including multiple delays and coupled weights and the periodic oscillation arises bifurcated from the trivial equilibrium after the network loses its stability. Stable regions on delay-dependence are displayed in the two delayed parameter plane. It is shown that multiple delays can produce stability switching between resting state and periodic activity. Finally, theoretical results are justified by providing two illustrative examples.     

Modules over cluster-tilted algebras that do not lie on local slices

We characterize the indecomposable transjective modules over an arbitrary cluster-tilted algebra that do not lie on a local slice, and we provide a sharp upper bound for the number of (isoclasses of) these modules.     

Efficient synthesis of 3,4-dihydropyrano[3,2-c]chromenes catalyzed by Ni(II)-functionalized Li<Superscript>+</Superscript>-Montmorillonite in a one-pot fashion under solvent-free conditions

A family of 3,4-dihydropyrano[3,2-c]chromenes were synthesized from 4-hydroxycoumarin and malononitrile via a one-pot reaction under solvent-free conditions at 100 °C catalyzed by Ni@Imine-Li⁺-MMT. This methodology tolerates most of the substrates and has the merits of lower loading of the catalyst, absence of solvents, excellent yields and reusability of the catalyst. A reasonable mechanism is also proposed. This catalytic system can be reused for at least five times with a negligible loss of activity. The prepared catalyst was characterized by using FTIR, TGA, SEM, TEM, uv-DRS, EDX and XRD.     

Evolving groups

The class of evolving groups is defined and investigated, as well as their connections to examples in the field of Galois cohomology. Evolving groups are proved to be Sylow Tower groups in a rather strong sense. In addition, evolving groups are characterized as semidirect products of two nilpotent groups of coprime orders where the action of one on the other is via automorphisms that map each subgroup to a conjugate.     

Rapid Learning-Based and Geologically Consistent History Matching

Various types of data become available at different stages of a reservoir’s life. The production data are integrated into the flow simulation models through a process referred to as history matching. The history-matching process is iterative, and it usually involves a large number of simulation runs. Hence, this process requires significant computational time. In most history-matching methods, the initial geological assumptions in the reservoir model are destroyed or significantly altered in the process. Furthermore, they do not account for the information obtained during the previous trials, and lack learning from the previous failures. In this paper, we introduce a new methodology that maintains the geological realism. The candidate realizations are selected through a learning-based history-matching (LHM) algorithm by which all the previously successful patterns are preserved and used to assist the construction of the next realizations. The various pieces of matching regions are assembled together to make a pool of the successful candidates. Such regions are then utilized for making an auxiliary dataset in a multiscale framework by which the next model is generated. To prevent from trapping in local minima, ideas from the genetic algorithm is adapted. The LHM algorithm can be applied to both categorical and continuous distributions. The LHM provides a conditional map by which the new production data are immediately incorporated into the existing reservoir models. We apply the LHM algorithm to various 2D and 3D examples with very complex binary and continuous properties. The algorithm is shown to produce history-matched models with significantly smaller CPU times.     

Infinitely many reducts of homogeneous structures

It is shown that the countably infinite dimensional pointed vector space (the vector space equipped with a constant) over a finite field has infinitely many first order definable reducts. This implies that the countable homogeneous Boolean-algebra has infinitely many reducts.     

Synthesis of <Emphasis Type="Italic">N</Emphasis>-hydroxy-imidamide-functionalized graphene: an efficient metal-free electrocatalyst for oxygen reduction

Metal-free electrocatalysts for oxygen reduction reaction (ORR) are key to the development of efficient, durable, and low-cost alternatives to noble-metal-based electrocatalysts in fuel cell cathodes. In recent years, many efforts are directed to the metal-free catalyst based on heteroatom-doped graphene. In this work, we demonstrate that the graphene surface can be converted into the catalyst for the oxygen reduction by chemical functionalization. In this context, we first synthesized malononitrile-functionalized graphene oxide. Amidoximation of nitrile group and reduction in graphene oxide were then carried out by hydroxylamine in one step. The electrochemical behavior of functionalized graphene-modified electrode for the reduction in oxygen was studied. The results showed that the electrocatalyst fabricated by this method exhibited striking catalytic activities in alkaline solution. In alkaline solution, this catalyst showed a competitive activity to the commercial Pt catalyst via four-electron transfer pathway with better ORR selectivity and stability. In addition, this metal-free electrocatalyst exhibited tolerance to methanol crossover effect. Based on its outstanding performance, this functionalized graphene electrocatalyst showed the promising prospect of a metal-free catalyst for fuel cell with much lower cost than currently used Pt/C catalyst.     

Extremal generalized centralizers in matrix algebras

We describe matrices with extremal generalized centralizers over algebraically closed fields.